Flat area characteristics of polygons circumscribing parabolic figures
نویسندگان
چکیده
منابع مشابه
Figures Circumscribing Circles
1. INTRODUCTION. The centroid of the boundary of an arbitrary triangle need not be at the same point as the centroid of its interior. But we have discovered that the two centroids are always collinear with the center of the inscribed circle, at distances in the ratio 3 : 2 from the center. We thought this charming fact must surely be known, but could find no mention of it in the literature. Thi...
متن کاملHamiltonian Triangulations and Circumscribing Polygons
Let Σ = { S1 , . . . , Sn } be a finite set of disjoint line segments in the plane. We conjecture that its visibility graph, Vis(Σ), is hamiltonian. In fact, we make the stronger conjecture that Vis(Σ) has a hamiltonian cycle whose embedded version is a simple polygon (i.e., its boundary edges are non-crossing visibility segments). We call such a simple polygon a spanning polygon of Σ. Existenc...
متن کاملFlat 2-Foldings of Convex Polygons
A folding of a simple polygon into a convex polyhedron is accomplished by glueing portions of the perimeter of the polygon together to form a polyhedron. A polygon Q is a flat n-folding of a polygon P if P can be folded to exactly cover the surface of Q n times, with no part of the surface of P left over. In this paper we focus on a specific type of flat 2-foldings, flat 2-foldings that wrap Q;...
متن کاملArea Problems Involving Kasner Polygons
Abstract. Sequences of polygons generated by performing iterative processes on an initial polygon have been studied extensively. One of the most popular sequences is the one sometimes referred to as Kasner polygons. Given a polygon K, the first Kasner descendant K ′ of K is obtained by placing the vertices of K ′ at the midpoints of the edges of K. More generally, for any fixed m in (0, 1) one ...
متن کاملMinimum Area All-flush Triangles Circumscribing a Convex Polygon
In this paper, we consider the problem of computing the minimum area triangle that circumscribes a given n-sided convex polygon touching edge-to-edge. In other words, we compute the minimum area triangle that is the intersection of 3 half-planes out of n half-planes defined by a given convex polygon. Previously, O(n logn) time algorithms were known which are based on the technique for computing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: E3S Web of Conferences
سال: 2020
ISSN: 2267-1242
DOI: 10.1051/e3sconf/202016402004